#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    LL sum=0;
    for(LL i=1;i<=n;i++){
        cin>>a[i];
        sum+=a[i];
    }
    LL X;cin>>X;
    LL tot=X/sum;
    LL now=tot*sum;
    LL ans=tot*n;
    if(now==X){
        cout<<ans+1<<endl;
        return 0;
    }
    for(LL i=1;i<=n;i++){
        now+=a[i];
        ans++;
        if(now>X){
           break;
        }
    }
    cout<<ans<<endl;
   	return 0;
}
